Search results for "discrete [space-time]"

showing 10 items of 2035 documents

Combinatorial aspects of L-convex polyominoes

2007

We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …

Discrete mathematicsClass (set theory)Mathematics::CombinatoricsPolyominoEnumerationOpen problemGenerating functionRegular polygonPolyominoesNatural numberComputer Science::Computational GeometryFormal SeriesCombinatoricsCardinalityRegular languageDiscrete Mathematics and CombinatoricsTomographyAlgorithmsbinary tomographyMathematicsEnumeration; Formal Series; PolyominoesEuropean Journal of Combinatorics
researchProduct

Enumerable classes of total recursive functions: Complexity of inductive inference

1994

This paper includes some results on complexity of inductive inference for enumerable classes of total recursive functions, where enumeration is considered in more general meaning than usual recursive enumeration. The complexity is measured as the worst-case mindchange (error) number for the first n functions of the given class. Three generalizations are considered.

Discrete mathematicsClass (set theory)Mathematics::CombinatoricsTheoretical computer scienceRecursively enumerable setRecursive functionsEnumerationInductive reasoningMathematics
researchProduct

Fixed Points for Weakα-ψ-Contractions in Partial Metric Spaces

2013

Recently, Samet et al. (2012) introduced the notion ofα-ψ-contractive mappings and established some fixed point results in the setting of complete metric spaces. In this paper, we introduce the notion of weakα-ψ-contractive mappings and give fixed point results for this class of mappings in the setting of partial metric spaces. Also, we deduce fixed point results in ordered partial metric spaces. Our results extend and generalize the results of Samet et al.

Discrete mathematicsClass (set theory)Metric spacePure mathematicsApplied MathematicsInjective metric spaceMetric mapProduct metricFixed pointAnalysisMathematicsIntrinsic metricConvex metric spaceAbstract and Applied Analysis
researchProduct

Fitting classes ℱ such that all finite groups have ℱ-injectors

1986

Let ℱ be an homomorph and Fitting class such thatEzℱ=ℱ. In this paper we prove that if all ℱ-constrained groups have ℱ-injectors, then all groups have ℱ-injectors. In particular if ℱ is a class of quasinilpotent groups containing the nilpotent groups, then every group has ℱ-injectors.

Discrete mathematicsClass (set theory)NilpotentPure mathematicsGroup (mathematics)General MathematicsAlgebra over a fieldNilpotent groupMathematicsIsrael Journal of Mathematics
researchProduct

Existentially closed central extensions of locally finite p-groups

1986

Throughout, p will be a fixed prime, and will denote the class of all locally finite p-groups. For a fixed Abelian p-group A, we letwhere ζ(P) denotes the centre of P. Notice that A is not a class in the usual group-theoretic sense, since it is not closed under isomorphisms.

Discrete mathematicsClass (set theory)NoticeGeneral MathematicsAbelian groupPrime (order theory)MathematicsExistentially closed modelMathematical Proceedings of the Cambridge Philosophical Society
researchProduct

Testing Grammars for Parsability

1990

In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser…

Discrete mathematicsClass (set theory)ParsingFinite-state machineGrammarComputer sciencemedia_common.quotation_subject16. Peace & justicecomputer.software_genreTuring machinesymbols.namesakeRule-based machine translationsymbolsRegular expressionLALR parsercomputermedia_common
researchProduct

On Formations of Finite Groups with the Wielandt Property for Residuals

2001

Abstract Given two subgroups U, V of a finite group which are subnormal subgroups of their join 〈U, V〉 and a formation F , in general it is not true that 〈U, V〉 F  = 〈U F , V F 〉. A formation is said to have the Wielandt property if this equality holds universally. A formation with the Wielandt property must be a Fitting class. Wielandt proved that the most usual Fitting formations (e.g., nilpotent groups and π-groups) have the Wielandt property. At present, neither a general satisfactory result on the universal validity of the Wielandt property nor a counterexample is known. In this paper a criterion for a Fitting formation to have the Wielandt property is given. As an application, it is p…

Discrete mathematicsClass (set theory)Pure mathematicsFinite groupProperty (philosophy)Algebra and Number Theorylattice propertiesJoin (topology)subnormal subgroupsresidualsNilpotentLattice propertiesformationsUniversal validityMathematicsCounterexampleJournal of Algebra
researchProduct

On point-irreducible projective lattice geometries

1994

Within the conceptual frame of projective lattice geometry (as introduced in [5]) we are considering the class of all point-irreducible geometries. In the algebraic context these geometries are closely connected with unitary modules over local rings. Besides several synthetic investigations we obtain a lattice-geometric characterization of free left modules over right chain rings which allows a purely lattice-theoretic version in the Artinian case.

Discrete mathematicsClass (set theory)Pure mathematicsLattice (module)Chain (algebraic topology)Local ringContext (language use)Point (geometry)Geometry and TopologyAlgebraic numberUnitary stateMathematicsJournal of Geometry
researchProduct

Analytic Extension of Non Quasi - Analytic Whitney Jets of Beurling Type

1998

Let (Mr)r∈ℕ0 be a logarithmically convex sequence of positive numbers which verifies M0 = 1 as well as Mr ≥ 1 for every r ∈ ℕ and defines a non quasi - analytic class. Let moreover F be a closed proper subset of ℝn. Then for every function f on ℝn belonging to the non quasi - analytic (Mr)-class of Beurling type, there is an element g of the same class which is analytic on ℝ,nF and such that Dαf(x) = Dαg(x) for every α ∈ ℕn0 and x ∈ F.

Discrete mathematicsClass (set theory)Pure mathematicsSequenceLogarithmically convex functionGeneral MathematicsExtension (predicate logic)Function (mathematics)Element (category theory)Type (model theory)MathematicsMathematische Nachrichten
researchProduct

On a class of languages recognizable by probabilistic reversible decide-and-halt automata

2009

AbstractWe analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and show that there is a strong relationship between DH-PRA and 1-way quantum automata. We show that a general class of regular languages is not recognizable by DH-PRA by proving that two “forbidden” constructions in minimal deterministic automata correspond to languages not recognizable by DH-PRA. The shown class is identical to a class known to be not recognizable by 1-way quantum automata. We also prove that the class of languages recognizable by DH-PRA is not closed under union and other non-trivial Boolean operations.

Discrete mathematicsClass (set theory)Quantum automataNested wordGeneral Computer ScienceProbabilistic logicAutomatonTheoretical Computer ScienceRegular languageDeterministic automatonProbabilistic automatonQuantum finite automataProbabilistic automataComputer Science::Formal Languages and Automata TheoryMathematicsComputer Science(all)Theoretical Computer Science
researchProduct